package com.bwt.algorithm.kmp;

public class ViolenceMatch {
    public static void main(String[] args) {

        //测试暴力匹配算法
        String str1 = "alksdhjnfklasdbnkfa";
        String str2 = "fkl34as";
        int index = violenceMatch(str1, str2);
        System.out.println(index);
    }

    public static int violenceMatch(String str1, String str2) {
        char[] s1 = str1.toCharArray();
        char[] s2 = str2.toCharArray();
        int s1Len = s1.length;
        int s2Len = s2.length;
        int i = 0;  // i索引指向s1
        int j = 0;// j 索引指向s2
        while (i < s1Len && j < s2.length) { //保证索引在检索时不越界
            if (s1[i] == s2[j]) {
                i++;
                j++;
            } else {
                i = i - j + 1;
                j = 0;
            }
        }

        if (j == s2Len ) {
            return i - j;
        } else {
            return -1;
        }
    }
}
